# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def combinationSum4(self, nums: List[int], target: int) -> int:
        nums_count = len(nums)

        if nums_count == 0:
            return 0

        min_nums = min(nums)
        if min_nums > target:
            return 0

        dp = [0] * (target + 1)
        dp[0] = 1

        for j in range(target + 1):
            for i in range(nums_count):
                if j >= nums[i]:
                    dp[j] += dp[j-nums[i]]

        return dp[-1]


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([1, 2, 3], 4, 7),
        ([9], 3, 0)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]

        expect = case_item[len(case_item) - 1]
        exec_result = solution.combinationSum4(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

